Ant Colony Optimization Algorithm for Robot Path Planning
نویسندگان
چکیده
-In this article two different optimization algorithms are presented to solve the deficiency of ant colony algorithm such as slow convergence rate and easy to fall into local optimum. This method based on Max-Min Ant System, established an adaptive model for pheromone evaporation coefficient adjusted adaptively and avoided the ants falling into local optimum. At the same time, this optimization algorithm used the strategy of the survival of the fittest way to optimize the pheromone update mechanism to accelerate the convergence rate. Finally, by comparison with ant colony algorithm, the simulation results show that, both the optimal path and routing time are optimized, and proved that the optimization algorithm is valid and feasible. Keywordspath planning; ant colony optimization algorithm; robot; Max-Min Ant System
منابع مشابه
A Hybrid Ant Colony Optimization Algorithm for Path Planning of Robot in Dynamic Environment1
Ant colony optimization and artificial potential field were used respectively as global path planning and local path planning methods in this paper. Some modifications were made to accommodate ant colony optimization to path planning. Pheromone generated by ant colony optimization was also utilized to prevent artificial potential field from getting local minimum. Simulation results showed that ...
متن کاملOptimization Planning based on Improved Ant Colony Algorithm for Robot
As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...
متن کاملAn Improved Ant Colony Optimization for the Multi-Robot Path Planning with Timeliness
To achieve efficient search performance for the multi-robot system which carries out the goal search task with consideration of timeliness, a multi-robot collaborative path planning system is designed to guide the robots during the search process. In the system, a planning method based on an Improved Ant Colony Optimization (IACO) algorithm is proposed. In the solution procedure, the path cost ...
متن کاملMobile Robot Path Planning Based on Multi-parameters Optimization Ant Colony Algorithm
The basic ant colony algorithm for mobile robot path planning has many problems, such as lack of stability,algorithm premature convergence, more difficult to find optimal solution for complex problems and so on. This paper proposes four improvement measures. 1. Apply genetic algorithm to optimization and configuration parameters of the basic ant colony algorithm; 2. Apply max min ant method to ...
متن کاملAn effective hybrid algorithm for mobile robot global path planning
Ant Colony Optimization (ACO) exhibits parallelism, contains certain redundancy and historical information of the past solutions with pheromone trail, and is suitable for implementation on massively parallel architecture. But it is not easy to avoid local optima, especially for large-scale schedule problems. Simulated annealing (SA) is a naturally serial algorithm, but its behavior can be contr...
متن کاملResearch on the mobile robots intelligent path planning based on ant colony algorithm application in manufacturing logistics
With the development of robotics and artificial intelligence field unceasingly thorough, path planning as an important field of robot calculation has been widespread concern. This paper analyzes the current development of robot and path planning algorithm and focuses on the advantages and disadvantages of the traditional intelligent path planning as well as the path planning. The problem of mob...
متن کامل